A note on algebraic integers
نویسندگان
چکیده
منابع مشابه
Algebraic Numbers and Algebraic Integers
c © W W L Chen, 1984, 2013. This chapter originates from material used by the author at Imperial College London between 1981 and 1990. It is available free to all individuals, on the understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied, with or without permission from the author. However, this document may not be kept on any information storage an...
متن کاملOn Z-Modules of Algebraic Integers
Let q be an algebraic integer of degree d ≥ 2. Consider the rank of the multiplicative subgroup of C generated by the conjugates of q. We say q is of full rank if either the rank is d− 1 and q has norm±1, or the rank is d. In this paper we study some properties of Z[q] where q is an algebraic integer of full rank. The special cases of when q is a Pisot number and when q is a Pisot-cyclotomic nu...
متن کاملDHT algorithm based on encoding algebraic integers
Introduction: The discrete Hartley transform (DHT) is an attractive alternative to the discrete Fourier transform (DFT) because of its real-valued computation and properties similar to those of the DFT [1]. Another interesting property of the DHT is that the same kernel is used for both the transform and its inverse transform. Consequently, since its introduction the DHT has found its way to ma...
متن کاملNote on Some Additive Properties of Integers
Let A=2 .3 . . . p r , the product of consecutive primes, be sufficiently large . By elementary method we prove that the number of solutions of the congruence p2-q2 =-0 (mod A) with 0 < q < p < A is greater than 1 A 1 + 41og log A . But the integers of the form p 2-q 2 with 0 < q< p < A lie all between 0 and A', hence there exists a multiple of 4 say n(<,4") such that the number of solutions of...
متن کاملA new DCT algorithm based on encoding algebraic integers
In this paper we introduce an algebraic integer encoding scheme for the basis matrix elements of DCTs and IDCTs. In particular, we encode the function and generate the other matrix elements using standard trigonometric identities. This encoding technique eliminates the requirement to approximate the matrix elements; rather we use algebraic ‘placeholders’ for them. Using this encoding scheme we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 1969
ISSN: 0022-314X
DOI: 10.1016/0022-314x(69)90033-x